Low-Cost Visual Feature Representations For Image Retrieval

نویسندگان

  • Ramon F. Pessoa
  • William R. Schwartz
  • Jefersson A. dos Santos
چکیده

This master’s theses addressed two research issues in order to investigate and to propose effective solutions for image retrieval on mobile devices: 1) low-cost representation for mobile image search and 2) spatial visual feature extraction. First, we have tested twenty mid-level representations of binary descriptors, ten color descriptors, five texture descriptors and two shape descriptors in ten datasets, considering the trade-off configuration regarding effectiveness, efficiency, and compactness of visual features. Finally, we propose two approaches of spatial bags of visual words called BOBGrid (spatial Bag Of BIC Grid) and BOBSlic (spatial Bag Of Slic) and compare them with our baselines. In statistical analyzes, BOBGrid and BOBSlic achieved processing results and performed better than our baselines WSA and BOSSANova. Keywords-Mobile Image Search; Global Descriptors; Binary Descriptors; Bag of Visual Words; Spatial Bag of Visual Words.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Method for Content Base Image Retrieval Using Combination of Local and Global Features

Content-based image retrieval (CBIR) has been an active research topic in the last decade. In this paper we proposed an image retrieval method using global and local features. Firstly, for local features extraction, SURF algorithm produces a set of interest points for each image and a set of 64-dimensional descriptors for each interest points and then to use Bag of Visual Words model, a cluster...

متن کامل

A Novel Method for Content Base Image Retrieval Using Combination of Local and Global Features

Content-based image retrieval (CBIR) has been an active research topic in the last decade. In this paper we proposed an image retrieval method using global and local features. Firstly, for local features extraction, SURF algorithm produces a set of interest points for each image and a set of 64-dimensional descriptors for each interest points and then to use Bag of Visual Words model, a cluster...

متن کامل

Image Classification via Sparse Representation and Subspace Alignment

Image representation is a crucial problem in image processing where there exist many low-level representations of image, i.e., SIFT, HOG and so on. But there is a missing link across low-level and high-level semantic representations. In fact, traditional machine learning approaches, e.g., non-negative matrix factorization, sparse representation and principle component analysis are employed to d...

متن کامل

روشی برای بازخورد ربط براساس بهبود تابع شباهت در بازیابی تصویر بر اساس محتوا

In content based image retrieval systems, the suitable visual features are extracted from images and stored in the feature database Then the feature database are searched to find the most similar images to the query image. In this paper, three types of visual features by 270 components were used for image indexing. Here, we use a weighted distance for similarity measurement between two images....

متن کامل

Steganography Scheme Based on Reed-Muller Code with Improving Payload and Ability to Retrieval of Destroyed Data for Digital Images

In this paper, a new steganography scheme with high embedding payload and good visual quality is presented. Before embedding process, secret information is encoded as block using Reed-Muller error correction code. After data encoding and embedding into the low-order bits of host image, modulus function is used to increase visual quality of stego image. Since the proposed method is able to embed...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016